On the Ranking Property and Underlying Dynamics of Complex Systems

نویسنده

  • Weibing DENG
چکیده

Ranking procedures are widely used to describe the phenomena in many different fields of social and natural sciences, e.g., sociology, economics, linguistics, demography, physics, biology, etc. In this dissertation, we dedicated to study the ranking properties and underlying dynamics embedded in complex systems. In particular, we focused on the scores/prizes ranking in sports systems and the words/characters usage ranking in human languages. The aim is to understand the mechanisms behind these issues by using the methods of statistical physics, Bayesian statistics and agent-based modeling. The concrete results concern the following aspects. We took up an interesting topic on the scores/prizes ranking in sports systems, and analyzed 40 data samples in 12 different sports fields. We found the striking similarities in different sports, i.e., the distributions of scores/prizes follow the universal power laws. We also showed that the data yielded the Pareto principle extensively observed in many social systems: 20% of the players accumulate 80% of the scores and money. For the tennis head-to-head data, we revealed that when two players compete, the probability that the higher-ranked player will win is related to the rank difference of the two opponents. In order to understand the origins of the universal scaling, we proposed an agent-based model, which can simulate the competitions of players in different matches, and results from our simulations are consistent with the empirical findings. Extensive simulation studies indicate that the model is quite robust with respect to the modifications of some parameters. Zipf’s law is the major regularity of statistical linguistics that served as a prototype for the rank-frequency relations and scaling laws in natural sciences. We investigated several English texts, clarified the valid range of Zipf’s law, and found this valid range increases upon mixing different texts. Based on the latent semantic analysis, we proposed a probabilistic model, in which we assumed that the words are drawn into the text with random probabilities, while their apriori density relates, via Bayesian statistics, to the general features of mental lexicon of the author who produced the text. Our model explained the Zipf’s law together with the limits of its validity, its generalization to high and low frequencies and hapax legomena. In another work, we specified the rank-frequency relations for Chinese characters. iii te l-0 08 39 31 0, v er si on 1 27 J un 2 01 3 We chose to study the short texts first, since for the sake of the rank-frequency analysis, long texts are just mixtures of shorter, thematically homogenous pieces. Our results showed that the Zipf’s law for Chinese characters perfectly holds for sufficiently short texts (few thousand different characters), and the scenario of its validity is similar to that for short English texts. We argued long Chinese texts display a two-layer, hierarchic structure: power-law rank-frequency characters (first layer) and the exponential ones (second layer). The previous results on the invalidity of the Zipf’s law for long texts are accounted for by showing that in between of the Zipfian range and the region of very rare characters (hapax legomena) there emerges a range of ranks, where the rank-frequency relation is approximately exponential. From comparative analysis of rank-frequency relations for Chinese and English, we suggested the characters play for Chinese writers the same role as the words for those writing within alphabetical systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperativity in biological systems

Living organisms can sense and respond to external and internal stimuli. Response isdemonstrated in many forms including modulation of gene expression profiles, motility,secretion, cell death, etc. Nevertheless, all forms share a basic property: they depend on sensingsmall changes in the concentration of an effector molecule or subtle conformational changes ina protein and invoking the appropri...

متن کامل

Reliability analysis of repairable systems using system dynamics modeling and simulation

Repairable standby system’s study and analysis is an important topic in reliability. Analytical techniques become very complicated and unrealistic especially for modern complex systems. There have been attempts in the literature to evolve more realistic techniques using simulation approach for reliability analysis of systems. This paper proposes a hybrid approach called as Markov system ...

متن کامل

The Paradox of Intervening in Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”

This commentary addresses two points raised by Kitson and colleagues’ article. First, increasing interest in applying the Complexity Theory lens in healthcare needs further systematic work to create some commonality between concepts used. Second, our need to adopt a better understanding of how these systems organise so we can change the systems overall behaviour, creates a paradox. We seek to m...

متن کامل

On the compactness property of extensions of first-order G"{o}del logic

We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...

متن کامل

Dynamics and Motion Control of Wheeled Robotic Systems

Mobile robotic systems, which include a mobile platform with one or more manipulators, mounted at specific locations on the mobile base, are of great interest in a number of applications. In this paper, after thorough kinematic studies on the platform and manipulator motions, a systematic methodology will be presented to obtain the dynamic equations for such systems without violating the base n...

متن کامل

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013